package BinarySearchTree;

public class Test {
    public static void main(String[] args) {
        BinarySearchTree binarySearchTree=new BinarySearchTree();
        test1(binarySearchTree);
        BinarySearchTree binarySearchTree1=new BinarySearchTree();
        test2(binarySearchTree1);
    }
    public static void test1(BinarySearchTree binarySearchTree) {
        System.out.println("==============test1==============");
        binarySearchTree.creatTree();
        TreeNode cur=binarySearchTree.find(80);
        //System.out.println(cur.val);
        binarySearchTree.insert(70);
        binarySearchTree.inOrder(binarySearchTree.root);
        System.out.println();
        System.out.println("==============test2==============");
    }
    public static void test2(BinarySearchTree binarySearchTree) {
        binarySearchTree.creatTree();
        binarySearchTree.remove(120);
        binarySearchTree.inOrder(binarySearchTree.root);
    }
}